A Randomly Weighted Minimum Arborescence with a Random Cost Constraint
نویسندگان
چکیده
We study the minimum spanning arborescence problem on complete digraph [Formula: see text], where an edge e has a weight W and cost C , each of which is independent uniform random variable U s text] text]. There also constraint that T must satisfy establish, for range values asymptotic value optimum via consideration dual problem.
منابع مشابه
A Fuzzy Random Minimum Cost Network Flow Programming Problem
In this paper, a fuzzy random minimum cost flow problem is presented. In this problem, cost parameters and decision variables are fuzzy random variables and fuzzy numbers respectively. The object of the problem is to find optimal flows of a capacitated network. Then, two algorithms are developed to solve the problem based on Er-expected value of fuzzy random variables and chance-constrained pro...
متن کاملSolving minimum-cost shared arborescence problems
In this work the minimum-cost shared network problem (MCSN) is introduced, where the objective is to find a minimum-cost subgraph, which is shared among multiple entities such that each entity is able to fulfil its own set of topological constraints. The topological constraints may induce structures like Steiner trees, minimum spanning trees, shortest paths, etc. The cost function to be minimiz...
متن کاملMinimum Cost Matching in a Random Graph with Random Costs
Let Gn,p be the standard Erdős-Rényi-Gilbert random graph and let Gn,n,p be the random bipartite graph on n + n vertices, where each e ∈ [n] appears as an edge independently with probability p. For a graph G = (V,E), suppose that each edge e ∈ E is given an independent uniform exponential rate one cost. Let C(G) denote the random variable equal to the length of the minimum cost perfect matching...
متن کاملA Mathematical Optimization Model for Solving Minimum Ordering Problem with Constraint Analysis and some Generalizations
In this paper, a mathematical method is proposed to formulate a generalized ordering problem. This model is formed as a linear optimization model in which some variables are binary. The constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. On the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...
متن کاملRainbow Arborescence in Random Digraphs
We consider the Erdős-Rényi random directed graph process, which is a stochastic process that starts with n vertices and no edges, and at each step adds one new directed edge chosen uniformly at random from the set of missing edges. Let D(n,m) be a graph with m edges obtained after m steps of this process. Each edge ei (i = 1, 2, . . . ,m) of D(n,m) independently chooses a colour, taken uniform...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2021
ISSN: ['0364-765X', '1526-5471']
DOI: https://doi.org/10.1287/moor.2021.1184